Weak Keys in Reduced AEGIS and Tiaoxin
نویسندگان
چکیده
AEGIS-128 and Tiaoxin-346 (Tiaoxin for short) are two AES-based primitives submitted to the CAESAR competition. Among them, has been selected in final portfolio high-performance applications, while Tiaoxin is a third-round candidate. Although both adopt stream cipher based design, they quite different from well-known bit-oriented ciphers like Trivium Grain family. Their common feature consists round update function, where state divided into several 128-bit words each word option pass through an AES or not. During 6-year competition, it surprising that there no third-party cryptanalysis of initialization phase. Due similarities primitives, we motivated investigate whether way evaluate security their phases. Our technical contribution write expressions internal states terms nonce key by treating as unit then carefully study how simplify these adding proper conditions. As result, find groups weak keys with 296 5-round 8-round Tiaoxin, which allows us construct integral distinguishers time complexity 232 data 232. Based on distinguisher, recover 272 AEGIS-128. However, recovery attack will require usage constant occurring probability 2?32. All attacks reach half total number rounds. We expect this work can advance understanding designs similar AEGIS Tiaoxin.
منابع مشابه
Weak Keys in MST1
The public key cryptosystem MST1 has been introduced in [9]. Its security relies on the hardness of factoring with respect to wild logarithmic signatures. To identify ‘wild-like’ logarithmic signatures, the criterion of being totally-non-transversal has been proposed. We give tame totally-non-transversal logarithmic signatures for the alternating and symmetric groups of degree ≥ 5. Hence, basin...
متن کاملGCM, GHASH and Weak Keys
The Galois/Counter Mode (GCM) of operation has been standardized by NIST to provide single-pass authenticated encryption. The GHASH authentication component of GCM belongs to a class of Wegman-Carter polynomial universal hashes that operate in the field GF (2). GCM uses the same block cipher key K to both encrypt data and to derive the generator H of the authentication polynomial. In present li...
متن کاملNew weak RSA keys
Let N = pq be an RSA modulus with q < p < 2q. In this paper, we analyze the security of RSA with the class of the exponents e satisfying an equation eX −NY = ap + bq + Z with |a| < q, b = ⌊ ap q ⌋ , X < N 3|ap + bq| and |Z| < |ap− bq| 3|ap + bq| N 1 4 , where bxc is the greatest integer less than or equal to x. Using the continued fraction algorithm and Coppersmith’s lattice reduction method fo...
متن کاملWeak Keys for IDEA
Large classes of weak keys have been found for the block cipher algorithm IDEA, previously known as IPES [2]. IDEA has a 128bit key and encrypts blocks of 64 bits. For a class of 2 keys IDEA exhibits a linear factor. For a certain class of 2 keys the cipher has a global characteristic with probability 1. For another class of 2 keys only two encryptions and solving a set of 16 nonlinear boolean ...
متن کاملWeak Keys of CRYPTON
The block cipher CRYPTON is a candidate proposal for the AES standard. In this report we describe a class of 232 weak keys. This is mainly a consequence of the use of linear operations in the key schedule. These weak keys especially have consequences for the use of CRYPTON in certain hash function constructions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR transaction on symmetric cryptology
سال: 2021
ISSN: ['2519-173X']
DOI: https://doi.org/10.46586/tosc.v2021.i2.104-139